- array subscript
- индекс массиваSyn:array indexсм. тж. index
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.
array subscript
Смотреть что такое "array subscript" в других словарях:
subscript — noun a) A type of lettering form written lower than the things around it. In chemical formulas the number of atoms in a molecule is written as a subscript, so we write HO for water which has two atoms of hydrogen for each one of oxygen. b) A… … Wiktionary
C (programming language) — C The C Programming Language[1] (aka K R ) is the seminal book on C … Wikipedia
COBOL — For other uses, see COBOL (disambiguation). COBOL LANGUAGE Paradigm(s) procedural, object oriented Appeared in 1959 (1959) Designed by Grace Hopper, William Selden, Gertrude Tierney, Howard Bromberg, Howard Discount, Vernon Reeves, Jean E.… … Wikipedia
Operators in C and C++ — This is a list of operators in the C and C++ programming languages. All the operators listed exist in C++; the fourth column Included in C , dictates whether an operator is also present in C. Note that C does not support operator overloading.… … Wikipedia
Promela — (Process or Protocol Meta Language) is a verification modeling language. The language allows for the dynamic creation of concurrent processes to model, for example, distributed systems. In PROMELA models, communication via message channels can be … Wikipedia
Ada (programming language) — For other uses of Ada or ADA, see Ada (disambiguation). Ada Paradigm(s) Multi paradigm Appeared in 1980 Designed by MIL STD 1815/Ada 83: Jean Ichbiah Ada 95: Tucker Taft Ada 2005: Tucker Taft Stable release … Wikipedia
Loop dependence analysis — In compiler theory, loop dependence analysis is the task of determining whether statements within a loop body form a dependence, almost always with respect to array access and modification. For a normalized loop: for i1 from l1 to u1 do for i2… … Wikipedia
Presburger arithmetic — is the first order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who published it in 1929. It is not as powerful as Peano arithmetic because it omits multiplication.OverviewThe language of Presburger… … Wikipedia
Wild branch — In computer programming, a wild branch is a description of a GOTO instruction where the target address is indeterminate, random or otherwise unintended. [ [http://www.priorartdatabase.com/IPCOM/000099292/ Debug Aid for Wild Branch Conditions ] ]… … Wikipedia
Fortran language features — This is a comprehensive overview of features of the Fortran 95 language, the version supported by almost all existing Fortran compilers. Old features that have been superseded by new ones are not described few of those historic features are used… … Wikipedia
Summation — For evaluation of sums in closed form see evaluating sums. : Summation is also a term used to describe a process in synapse biology. Summation is the addition of a set of numbers; the result is their sum or total . The numbers to be summed may be … Wikipedia
